The joy of implications, aka pure Horn formulas: Mainly a survey
نویسنده
چکیده
Pure Horn clauses have also been called (among others) functional dependencies, strong association rules, or simply implications. We survey the mathematical theory of implications with an emphasis on the progress made in the last 30 years.
منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملThe Phase Centre of a Pure Mode, Smooth Wall, Conical Horn
In this paper the phase centre of a pure mode, smooth wall, conical horn is studied. The method employed uses phase information obtained by aperture integration of the phase corrected mode field but differs from earlier presentations in first reducing the radiation integrals in terms of an identified family of functions prior to integration. The result is formulas for the principal plane radiat...
متن کاملطراحی و ارزیابی کیت آنتی بادی ضد کراتین [AKA] در بیماران آرتریت روماتویید
Background and purpose: Rheumatoid Arthritis (RA) is a systemic auto immune Rheumatoid diseases. Auto antibodies are detected in this disease, with diagnostic and prognostic properties. One of them is AKA which reacts with the fibrous keratin in epiderm and the stratum corneum of rat esophageal epithelium. Hence at first AKA – IFA kit was designed, then its sensitivety and specificity was me...
متن کاملFuzzy Horn logic I
The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theori...
متن کاملUniform Proofs as a Foundation for Logic Programming
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 658 شماره
صفحات -
تاریخ انتشار 2017